National security,military spending and the business cycle

This paper develops a Dynamic Stochastic General Equilibrium model where national security is an argument in the agent’s utility function and the government chooses optimally the level of military spending to maximize social welfare. National defense depends on military expenditure and on the strategic environment reflecting a potential hostile external threat. We use aggregate data on consumption, investment, and military spending for the US economy to estimate the parameters of the model. Estimation results suggest that consumption and national defense are complements and that military spending variability is mainly explained by external threat shocks although it also depends on the macroeconomic conditions. We compute impulse response functions of the main macroeconomic variables to several shocks: a total factor productivity shock, a defense technology shock, and a strategic environment shock. Surprisingly, we find that the optimal response to an increase in the external threat (a worsening in the strategic environment) will rise output by reducing consumption and increasing investment.     

Robustness of efficient server assignment policies to service time distributions in finite‐buffered lines

We study the assignment of flexible servers to stations in tandem lines with service times that are not necessarily exponentially distributed. Our goal is to achieve optimal or near‐optimal throughput. For systems with infinite buffers, it is already known that the effective assignment of flexible servers is robust to the service time distributions. We provide analytical results for small systems and numerical results for larger systems that support the same conclusion for tandem lines with finite buffers. In the process, we propose server assignment heuristics that perform well for systems with different service time distributions. Our research suggests that policies known to be optimal or near‐optimal for Markovian systems are also likely to be effective when used to assign servers to tasks in non‐Markovian systems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Replicated batch means for steady‐state simulations

This paper studies a new steady‐state simulation output analysis method called replicated batch means in which a small number of replications are conducted and the observations in these replications are grouped into batches. This paper also introduces and compares methods for selecting the initial state of each replication. More specifically, we show that confidence intervals constructed by the replicated batch means method are valid for large batch sizes and derive expressions for the expected values and variances of the steady‐state mean and variance estimators for stationary processes and large sample sizes. We then use these expressions, analytical examples, and numerical experiments to compare the replicated batch means method with the standard batch means and multiple replications methods. The numerical results, which are obtained from an AR(1) process and a small, nearly‐decomposable Markov chain, show that the multiple replications method often gives confidence intervals with poorer coverage than the standard and replicated batch means methods and that the replicated batch means method, implemented with good choices of initialization method and number of replications, provides confidence interval coverages that range from being comparable with to being noticeably better than coverages obtained by the standard batch means method. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Piracy,state capacity and root causes

By comparing the Somali experience of piracy with the emerging situation in the Gulf of Guinea, I show that increases in the enforcement aspects of state capacity in the Gulf of Guinea states are necessary but not sufficient tools to combat the emergence, growth, and institutionalisation of piracy. Such tools would require state-building measures that would minimise the incentives of individuals to join piracy organisations and they would have to effectively deal with youth unemployment, income inequality, and environmental degradation.     

Identifying the spoilers in the security sector reform – disarmament demobilisation and reintegration process in the Congo

The Congolese security sector reform – disarmament demobilisation and reintegration (SSR-DDR) process has suffered from setbacks in its military sector during the last 10 years, such as insufficient funding, lack of coordination and domestic reluctance to major changes, with as a result, a very fragile and disjointed Army. These problems have deepened as officers have defected from the Army and caused new instability in the East of the Congo. This article aims to analyse the recent mutinies and the reaction by the Congolese government by applying a capabilities-based approach in combination with a typology of spoilers. The objective is to identify and classify the spoilers and answer the questions of why they emerge now and how they are dealt with on a national level. From the analysis, the author suggests that there are several spoilers involved in the current situation – the most powerful being the Congolese and the Rwandan governments, prompting the question of whether an international involvement is necessary to solve the problem.     

Fully sequential procedures for comparing constrained systems via simulation

We consider the problem of finding the system with the best primary performance measure among a finite number of simulated systems in the presence of a stochastic constraint on a single real‐valued secondary performance measure. Solving this problem requires the identification and removal from consideration of infeasible systems (Phase I) and of systems whose primary performance measure is dominated by that of other feasible systems (Phase II). We use indifference zones in both phases and consider two approaches, namely, carrying out Phases I and II sequentially and carrying out Phases I and II simultaneously, and we provide specific example procedures of each type. We present theoretical results guaranteeing that our approaches (general and specific, sequential and simultaneous) yield the best system with at least a prespecified probability, and we provide a portion of an extensive numerical study aimed at evaluating and comparing the performance of our approaches. The experimental results show that both new procedures are useful for constrained ranking and selection, with neither procedure showing uniform superiority over the other.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Ireland's Ho Chi Minh trail? The Republic of Ireland's role in the Provisional IRA's bombing campaign, 1970–1976

A common criticism levelled at successive governments of the Republic of Ireland during the Northern Ireland ‘Troubles’ was their alleged inactivity in the face of a ferocious Provisional IRA campaign. Such criticisms were based in large part on the perception of the southern state as a supply base for militant republicanism. The Republic was undoubtedly a formidable logistics hinterland for such militants. However, criticisms of the reactions of authorities in the south are unfair. This article considers the explosives capabilities of the IRA during the first six years of their campaign. It does so with reference to their attempts to obtain commercial explosives as well as measures employed by them to obtain homemade explosives. The article also considers countermeasures employed by the southern government and reveals the extent to which they sought to shut down IRA capabilities in the south. It is argued that, ultimately, the IRA's campaign in this regard could only be contained and never unilaterally halted.     

Approximating nondominated sets in continuous multiobjective optimization problems

Many important problems in Operations Research and Statistics require the computation of nondominated (or Pareto or efficient) sets. This task may be currently undertaken efficiently for discrete sets of alternatives or for continuous sets under special and fairly tight structural conditions. Under more general continuous settings, parametric characterisations of the nondominated set, for example through convex combinations of the objective functions or ε‐constrained problems, or discretizations‐based approaches, pose several problems. In this paper, the lack of a general approach to approximate the nondominated set in continuous multiobjective problems is addressed. Our simulation‐based procedure only requires to sample from the set of alternatives and check whether an alternative dominates another. Stopping rules, efficient sampling schemes, and procedures to check for dominance are proposed. A continuous approximation to the nondominated set is obtained by fitting a surface through the points of a discrete approximation, using a local (robust) regression method. Other actions like clustering and projecting points onto the frontier are required in nonconvex feasible regions and nonconnected Pareto sets. In a sense, our method may be seen as an evolutionary algorithm with a variable population size. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A O(nm log(U/n)) time maximum flow algorithm

In this paper, we present an O(nm log(U/n)) time maximum flow algorithm. If U = O(n) then this algorithm runs in O(nm) time for all values of m and n. This gives the best available running time to solve maximum flow problems satisfying U = O(n). Furthermore, for unit capacity networks the algorithm runs in O(n^2/3m) time. It is a two‐phase capacity scaling algorithm that is easy to implement and does not use complex data structures. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 511–520, 2000     

Waiting time analysis of the M/G/1 queue with finite retrial group

We consider an M/G/1 retrial queue with finite capacity of the retrial group. First, we obtain equations governing the dynamic of the waiting time. Then, we focus on the numerical inversion of the density function and the computation of moments. These results are used to approximate the waiting time of the M/G/1 queue with infinite retrial group for which direct analysis seems intractable. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007